Design of Efficient Caching Algorithms for Peer to Peer Networks to Reduce Traffic in Internet

Peer-to-peer (P2P) file sharing systems generate a major portion of the Internet traffic, and this portion is expected to increase in the future. We explore the potential of deploying proxy caches in different autonomous systems with the goal of reducing the cost incurred by Internet service providers and alleviating the load on the Internet backbone. P2P traffic is more complex than caching other internet traffic and needs several new algorithms and storage systems. The paper presents the design and evaluation of a entire, running, proxy cache for P2P traffic, referred to as PrCache. PrCache transparently intercepts and serves traffic from different P2P systems. A replacement storage system is projected and enforced in PrCache. Storage system is optimized for storing P2P traffic, and shown to outperform other storage systems. A new algorithm to infer the information required to store and serve P2P traffic by the cache is proposed. Extensive experiments to evaluate all aspects of PrCache using actual implementation and real P2P traffic are presented. Based on the analysis, proposed a new algorithm, called Optimized Least Grade Replacement (OLGR), takes recency, frequency, perfect-history, and document size under consideration for Web cache optimization.